DNA self-assembly for constructing 3D boxesKAO, Ming-Yang; RAMACHANDRAN, Vijay.Lecture notes in computer science. 2001, pp 429-440, issn 0302-9743, isbn 3-540-42985-9Conference Paper

Entropy measures of physics via complexityKANIADAKIS, Giorgio; TOPSØE, Flemming.IEEE International Symposium on Information Theory. 2004, isbn 0-7803-8280-3, 1Vol, p. 41Conference Paper

Computational capabilities of multilayer committee machinesNEIROTTI, J. P; FRANCO, L.Journal of physics. A, Mathematical and theoretical (Print). 2010, Vol 43, Num 44, issn 1751-8113, 445103.1-445103.26Article

Mesure naturelle de la complexité des systèmes et de leur architecturePRINTZ, Jacques.Génie logiciel (1995). 2007, Num 82, pp 8-22, issn 1265-1397, 15 p.Article

Accounting for complexity in costing high technology manufacturingCOOPER, W. W; SINHA, K. K; SULLIVAN, R. S et al.European journal of operational research. 1995, Vol 85, Num 2, pp 316-326, issn 0377-2217Article

Measures of complexity in wind directionCHANDA, A; DAS, J.Journal of Technical Physics. 2003, Vol 44, Num 2, pp 207-214, issn 0324-8313, 8 p.Article

Wie gross ist die Aussagekraft heutiger Software-Metriken ? = How meaningful are today's software metrics?BAUMANN, P; RICHTER, L.Wirtschaftsinformatik. 1992, Vol 34, Num 6, pp 624-631, issn 0937-6429Article

A generalized statistical complexity measure: Applications to quantum systemsLOPEZ-RUIZ, R; NAGY, A; ROMERA, E et al.Journal of mathematical physics. 2009, Vol 50, Num 12, issn 0022-2488, 123528.1-123528.10Article

Sharpening Occam's razorMING LI; TROMP, John; VITANYI, Paul et al.Lecture notes in computer science. 2002, pp 411-419, issn 0302-9743, isbn 3-540-43996-X, 9 p.Conference Paper

Modified Cognitive Complexity MeasureMISRA, Sanjay.Lecture notes in computer science. 2006, pp 1050-1059, issn 0302-9743, isbn 3-540-47242-8, 1Vol, 10 p.Conference Paper

Sensitive functions and approximate problemsCHAUDHURI, S.Information and computation (Print). 1996, Vol 126, Num 2, pp 161-168, issn 0890-5401Article

Rank, trace-norm and max-normSREBRO, Nathan; SHRAIBMAN, Adi.Lecture notes in computer science. 2005, pp 545-560, issn 0302-9743, isbn 3-540-26556-2, 16 p.Conference Paper

On convex complexity measuresHRUBES, P; JUKN, S; KULIKOV, A et al.Theoretical computer science. 2010, Vol 411, Num 16-18, pp 1842-1854, issn 0304-3975, 13 p.Article

The Tenjinno Machine Translation CompetitionSTARKIE, Bradford; VAN ZAANEN, Menno; ESTIVAL, Dominique et al.Lecture notes in computer science. 2006, pp 214-226, issn 0302-9743, isbn 3-540-45264-8, 1Vol, 13 p.Conference Paper

Décompositions paradoxales des groupes de Burnside = Paradoxal decompositions of free Burnside groupsCECCHERINI-SILBERSTEIN, T; GRIGORCHUK, R; DE LA HARPE, P et al.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1998, Vol 327, Num 2, pp 127-132, issn 0764-4442Article

Evaluating and extending NPath as a software complexity measureMCCOLL, R. B; MCKIM, J. C.The Journal of systems and software. 1992, Vol 17, Num 3, pp 275-279, issn 0164-1212Article

The π measureNIKOLIK, B.IET software (Print). 2008, Vol 2, Num 5, pp 404-416, issn 1751-8806, 13 p.Article

A note on universal measures for weak implicit computational complexityBECKMANN, Arnold.Lecture notes in computer science. 2002, pp 53-67, issn 0302-9743, isbn 3-540-00010-0, 15 p.Conference Paper

A note on the Kolmogorov data complexity and nonuniform logical definitionsTYSZKIEWICZ, J.Information processing letters. 1997, Vol 64, Num 4, pp 187-195, issn 0020-0190Article

Histogram regression estimation using data-dependent partitionsNOBEL, A.Annals of statistics. 1996, Vol 24, Num 3, pp 1084-1105, issn 0090-5364Article

Measures of complexity for 3D image analysis of trabecular boneMARWAN, N; SAPARIN, P; KURTHS, J et al.The European physical journal. Special topics. 2007, Vol 143, pp 109-116, 8 p.Conference Paper

On a syntactic characterization of classification with a mind change boundMARTIN, Eric; SHARMA, Arun.Lecture notes in computer science. 2005, pp 413-428, issn 0302-9743, isbn 3-540-26556-2, 16 p.Conference Paper

Classifier selection based on data complexity measuresHERNANDEZ-REYES, Edith; CARRASCO-OCHOA, J. A; MARTINEZ-TRINIDAD, J. Fco et al.Lecture notes in computer science. 2005, pp 586-592, issn 0302-9743, isbn 3-540-29850-9, 1Vol, 7 p.Conference Paper

Linear complexity and related complexity measures for sequencesNIEDERREITER, Harald.Lecture notes in computer science. 2003, pp 1-17, issn 0302-9743, isbn 3-540-20609-4, 17 p.Conference Paper

Variants of realizability for propositional formulas and the logic of the weak law of excluded middleCHERNOV, Alexey V; SKVORTSOV, Dmitriy P; SKVORTSOVA, Elena Z et al.Lecture notes in computer science. 2002, pp 74-88, issn 0302-9743, isbn 3-540-44240-5, 15 p.Conference Paper